import math
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
freq = {}
for i in range(n):
if a[i] in freq:
freq[a[i]] += 1
else:
freq[a[i]] = 1
freq_arr = []
for key in freq:
freq_arr.append((key, freq[key]))
freq_arr.sort()
dp = []
dp.append([0 for i in range(len(freq_arr))])
for i in range(len(freq_arr)//2):
dp.append([float('inf') for j in range(len(freq_arr))])
for i in range(1, len(dp)):
for j in range(1, len(dp[0])):
if not math.isinf(dp[i-1][j-1]):
if i-1 + freq_arr[j][1] + dp[i-1][j-1] <= j:
dp[i][j] = min(dp[i][j-1], freq_arr[j][1] + dp[i-1][j-1])
else:
dp[i][j] = dp[i][j-1]
else:
dp[i][j] = dp[i][j-1]
remove = 0
for i in range(1, len(dp)):
if not math.isinf(dp[i][-1]):
remove = i
print(len(freq_arr) - remove)
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |